On some third parts of nearly complete digraphs
نویسندگان
چکیده
منابع مشابه
On some third parts of nearly complete digraphs
For the complete digraph DKn with n¿3, its half as well as its third (or near-third) part, both non-self-converse, are exhibited. A backtracking method for generating a tth part of a digraph is sketched. It is proved that some self-converse digraphs are not among the near-third parts of the complete digraph DK5 in four of the six possible cases. For n = 9 + 6k; k = 0; 1; : : : ; a third part D ...
متن کاملDecompositions of nearly complete digraphs into t isomorphic parts
An arc decomposition of the complete digraph DKn into t isomorphic subdigraphs is generalized to the case where the numerical divisibility condition is not satisfied. Two sets of nearly tth parts are constructively proved to be nonempty. These are the floor tth class (DKn − R)/t and the ceiling tth class (DKn + S)/t, where R and S comprise (possibly copies of) arcs whose number is the smallest ...
متن کاملSome Notes on Nuf Digraphs
For the moment, we outline how to characterise undirected, irreflexive graphs that admit a near-unanimity operation of arity at most k using the notion of dual of a tree; the same is done for reflexive graphs, and for directed bipartite graphs. We hope to complete this by showing that the generating sets for the varieties in question contain only chordal extensible graphs.
متن کاملSome Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problems and directed k-leaf problems. We also prove some new results on the topic. Most of these new results are on parameterizations of the backward paired comparison problem.
متن کاملShortest Paths in Nearly Conservative Digraphs
We introduce the following notion: a digraph D = (V,A) with arc weights c : A → R is called nearly conservative if every negative cycle consists of two arcs. Computing shortest paths in nearly conservative digraphs is NP-hard, and even deciding whether a digraph is nearly conservative is coNP-complete. We show that the “All Pairs Shortest Path” problem is fixed parameter tractable with various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00214-9